0.04/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.11/0.12 % Command : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC 0.13/0.33 % Computer : n016.cluster.edu 0.13/0.33 % Model : x86_64 x86_64 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.33 % Memory : 8042.1875MB 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.33 % CPULimit : 1200 0.13/0.33 % WCLimit : 120 0.13/0.33 % DateTime : Tue Jul 13 12:03:38 EDT 2021 0.13/0.34 % CPUTime : 0.13/0.34 % Number of cores: 8 0.13/0.34 % Python version: Python 3.6.8 0.13/0.34 # Version: 2.6rc1-ho 0.13/0.34 # No SInE strategy applied 0.13/0.34 # Trying AutoSched0 for 59 seconds 59.18/59.35 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S083I 59.18/59.35 # and selection function SelectCQArNT. 59.18/59.35 # 59.18/59.35 # Preprocessing time : 0.028 s 59.18/59.35 # Presaturation interreduction done 59.22/59.43 # No success with AutoSched0 59.22/59.43 # Trying AutoSched1 for 26 seconds 85.26/85.44 # AutoSched1-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN 85.26/85.44 # and selection function PSelectComplexExceptUniqMaxHorn. 85.26/85.44 # 85.26/85.44 # Preprocessing time : 0.029 s 85.26/85.44 # Presaturation interreduction done 85.30/85.52 # No success with AutoSched1 85.30/85.52 # Trying AutoSched2 for 8 seconds 93.32/93.54 # AutoSched2-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S08CI 93.32/93.54 # and selection function SelectCQIPrecWNTNp. 93.32/93.54 # 93.32/93.54 # Preprocessing time : 0.029 s 93.32/93.54 # Presaturation interreduction done 93.32/93.56 # No success with AutoSched2 93.32/93.56 # Trying AutoSched3 for 7 seconds 100.35/100.56 # AutoSched3-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y 100.35/100.56 # and selection function SelectMaxLComplexAvoidPosPred. 100.35/100.56 # 100.35/100.56 # Preprocessing time : 0.030 s 100.35/100.58 # No success with AutoSched3 100.35/100.58 # Trying AutoSched4 for 5 seconds 100.58/100.80 # AutoSched4-Mode selected heuristic H_____047_B31_F1_PI_AE_R4_CS_SP_S2S 100.58/100.80 # and selection function SelectNewComplexAHP. 100.58/100.80 # 100.58/100.80 # Preprocessing time : 0.029 s 100.58/100.80 100.58/100.80 # Proof found! 100.58/100.80 # SZS status Theorem 100.58/100.80 # SZS output start CNFRefutation 100.58/100.80 thf(cGROUP2_def, axiom, (cGROUP2)=(^[X1:g > g > g, X5:g]:((![X8:g, X9:g, X10:g]:(X1 @ (X1 @ X8 @ X9) @ X10)=(X1 @ X8 @ (X1 @ X9 @ X10))&![X11:g]:(X1 @ X5 @ X11)=(X11))&![X12:g]:?[X13:g]:(X1 @ X13 @ X12)=(X5))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', cGROUP2_def)). 100.58/100.80 thf(cGRP_ASSOC_def, axiom, (cGRP_ASSOC)=(^[X1:g > g > g]:![X2:g, X3:g, X4:g]:(X1 @ (X1 @ X2 @ X3) @ X4)=(X1 @ X2 @ (X1 @ X3 @ X4))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', cGRP_ASSOC_def)). 100.58/100.80 thf(cGRP_LEFT_INVERSE_def, axiom, (cGRP_LEFT_INVERSE)=(^[X1:g > g > g, X5:g]:![X2:g]:?[X3:g]:(X1 @ X3 @ X2)=(X5)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', cGRP_LEFT_INVERSE_def)). 100.58/100.80 thf(cGRP_LEFT_UNIT_def, axiom, (cGRP_LEFT_UNIT)=(^[X1:g > g > g, X5:g]:![X2:g]:(X1 @ X5 @ X2)=(X2)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', cGRP_LEFT_UNIT_def)). 100.58/100.80 thf(cGROUP3_def, axiom, (cGROUP3)=(^[X1:g > g > g, X5:g]:((![X14:g, X15:g, X16:g]:(X1 @ (X1 @ X14 @ X15) @ X16)=(X1 @ X14 @ (X1 @ X15 @ X16))&![X17:g]:(X1 @ X17 @ X5)=(X17))&![X18:g]:?[X19:g]:(X1 @ X18 @ X19)=(X5))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', cGROUP3_def)). 100.58/100.80 thf(cGRP_RIGHT_INVERSE_def, axiom, (cGRP_RIGHT_INVERSE)=(^[X1:g > g > g, X5:g]:![X2:g]:?[X3:g]:(X1 @ X2 @ X3)=(X5)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', cGRP_RIGHT_INVERSE_def)). 100.58/100.80 thf(cGRP_RIGHT_UNIT_def, axiom, (cGRP_RIGHT_UNIT)=(^[X1:g > g > g, X5:g]:![X2:g]:(X1 @ X2 @ X5)=(X2)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', cGRP_RIGHT_UNIT_def)). 100.58/100.80 thf(cEQUIV_02_03, conjecture, ![X1:g > g > g, X5:g]:(cGROUP3 @ X1 @ X5<=>cGROUP2 @ X1 @ X5), file('/export/starexec/sandbox/benchmark/theBenchmark.p', cEQUIV_02_03)). 100.58/100.80 thf(c_0_8, axiom, (cGROUP2)=(^[X1:g > g > g, X5:g]:((![X8:g, X9:g, X10:g]:(X1 @ (X1 @ X8 @ X9) @ X10)=(X1 @ X8 @ (X1 @ X9 @ X10))&![X11:g]:(X1 @ X5 @ X11)=(X11))&![X12:g]:?[X13:g]:(X1 @ X13 @ X12)=(X5))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[cGROUP2_def, cGRP_ASSOC_def]), cGRP_LEFT_INVERSE_def]), cGRP_LEFT_UNIT_def])). 100.58/100.80 thf(c_0_9, axiom, (cGROUP3)=(^[X1:g > g > g, X5:g]:((![X14:g, X15:g, X16:g]:(X1 @ (X1 @ X14 @ X15) @ X16)=(X1 @ X14 @ (X1 @ X15 @ X16))&![X17:g]:(X1 @ X17 @ X5)=(X17))&![X18:g]:?[X19:g]:(X1 @ X18 @ X19)=(X5))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[cGROUP3_def, cGRP_ASSOC_def]), cGRP_RIGHT_INVERSE_def]), cGRP_RIGHT_UNIT_def])). 100.58/100.80 thf(c_0_10, negated_conjecture, ~(![X1:g > g > g, X5:g]:(((![X20:g, X21:g, X22:g]:(X1 @ (X1 @ X20 @ X21) @ X22)=(X1 @ X20 @ (X1 @ X21 @ X22))&![X23:g]:(X1 @ X23 @ X5)=(X23))&![X24:g]:?[X25:g]:(X1 @ X24 @ X25)=(X5))<=>((![X26:g, X27:g, X28:g]:(X1 @ (X1 @ X26 @ X27) @ X28)=(X1 @ X26 @ (X1 @ X27 @ X28))&![X29:g]:(X1 @ X5 @ X29)=(X29))&![X30:g]:?[X31:g]:(X1 @ X31 @ X30)=(X5)))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[cEQUIV_02_03]), c_0_8]), c_0_9])). 100.58/100.80 thf(c_0_11, negated_conjecture, ![X39:g, X45:g, X46:g, X47:g, X48:g, X49:g, X50:g, X52:g, X53:g, X54:g, X55:g, X56:g]:(((esk1_0 @ (esk1_0 @ esk3_0 @ esk4_0) @ esk5_0)!=(esk1_0 @ esk3_0 @ (esk1_0 @ esk4_0 @ esk5_0))|(esk1_0 @ esk6_0 @ esk2_0)!=(esk6_0)|(esk1_0 @ esk7_0 @ X39)!=(esk2_0)|((esk1_0 @ (esk1_0 @ esk8_0 @ esk9_0) @ esk10_0)!=(esk1_0 @ esk8_0 @ (esk1_0 @ esk9_0 @ esk10_0))|(esk1_0 @ esk2_0 @ esk11_0)!=(esk11_0)|(esk1_0 @ X45 @ esk12_0)!=(esk2_0)))&((((((esk1_0 @ (esk1_0 @ X52 @ X53) @ X54)=(esk1_0 @ X52 @ (esk1_0 @ X53 @ X54))|(esk1_0 @ (esk1_0 @ X46 @ X47) @ X48)=(esk1_0 @ X46 @ (esk1_0 @ X47 @ X48)))&((esk1_0 @ esk2_0 @ X55)=(X55)|(esk1_0 @ (esk1_0 @ X46 @ X47) @ X48)=(esk1_0 @ X46 @ (esk1_0 @ X47 @ X48))))&((esk1_0 @ (esk14_1 @ X56) @ X56)=(esk2_0)|(esk1_0 @ (esk1_0 @ X46 @ X47) @ X48)=(esk1_0 @ X46 @ (esk1_0 @ X47 @ X48))))&((((esk1_0 @ (esk1_0 @ X52 @ X53) @ X54)=(esk1_0 @ X52 @ (esk1_0 @ X53 @ X54))|(esk1_0 @ X49 @ esk2_0)=(X49))&((esk1_0 @ esk2_0 @ X55)=(X55)|(esk1_0 @ X49 @ esk2_0)=(X49)))&((esk1_0 @ (esk14_1 @ X56) @ X56)=(esk2_0)|(esk1_0 @ X49 @ esk2_0)=(X49))))&((((esk1_0 @ (esk1_0 @ X52 @ X53) @ X54)=(esk1_0 @ X52 @ (esk1_0 @ X53 @ X54))|(esk1_0 @ X50 @ (esk13_1 @ X50))=(esk2_0))&((esk1_0 @ esk2_0 @ X55)=(X55)|(esk1_0 @ X50 @ (esk13_1 @ X50))=(esk2_0)))&((esk1_0 @ (esk14_1 @ X56) @ X56)=(esk2_0)|(esk1_0 @ X50 @ (esk13_1 @ X50))=(esk2_0))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])])])). 100.58/100.80 thf(c_0_12, negated_conjecture, ![X2:g, X3:g, X4:g, X5:g, X7:g, X8:g]:((esk1_0 @ (esk1_0 @ X2 @ X3) @ X4)=(esk1_0 @ X2 @ (esk1_0 @ X3 @ X4))|(esk1_0 @ (esk1_0 @ X5 @ X7) @ X8)=(esk1_0 @ X5 @ (esk1_0 @ X7 @ X8))), inference(split_conjunct,[status(thm)],[c_0_11])). 100.58/100.80 thf(c_0_13, negated_conjecture, ![X2:g, X3:g, X4:g]:(esk1_0 @ (esk1_0 @ X2 @ X3) @ X4)=(esk1_0 @ X2 @ (esk1_0 @ X3 @ X4)), inference(ef,[status(thm)],[c_0_12])). 100.58/100.80 thf(c_0_14, negated_conjecture, ![X2:g, X3:g]:((esk1_0 @ esk2_0 @ X2)=(X2)|(esk1_0 @ X3 @ (esk13_1 @ X3))=(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_11])). 100.58/100.80 thf(c_0_15, negated_conjecture, ![X2:g, X3:g]:((esk1_0 @ esk2_0 @ X2)=(X2)|(esk1_0 @ X3 @ esk2_0)=(X3)), inference(split_conjunct,[status(thm)],[c_0_11])). 100.58/100.80 thf(c_0_16, negated_conjecture, ![X2:g, X3:g, X4:g]:((esk1_0 @ X2 @ (esk1_0 @ (esk13_1 @ X2) @ X3))=(esk1_0 @ esk2_0 @ X3)|(esk1_0 @ esk2_0 @ X4)=(X4)), inference(spm,[status(thm)],[c_0_13, c_0_14])). 100.58/100.80 thf(c_0_17, negated_conjecture, (esk1_0 @ esk2_0 @ esk2_0)=(esk2_0), inference(ef,[status(thm)],[c_0_15])). 100.58/100.80 thf(c_0_18, negated_conjecture, ![X2:g, X3:g, X4:g]:((esk1_0 @ esk2_0 @ (esk13_1 @ (esk13_1 @ X2)))=(esk1_0 @ X2 @ esk2_0)|(esk1_0 @ esk2_0 @ X3)=(X3)|(esk1_0 @ esk2_0 @ X4)=(X4)), inference(spm,[status(thm)],[c_0_16, c_0_14])). 100.58/100.80 thf(c_0_19, negated_conjecture, ![X2:g]:(esk1_0 @ esk2_0 @ (esk1_0 @ esk2_0 @ X2))=(esk1_0 @ esk2_0 @ X2), inference(spm,[status(thm)],[c_0_13, c_0_17])). 100.58/100.80 thf(c_0_20, negated_conjecture, ![X2:g, X3:g]:((esk1_0 @ esk2_0 @ (esk13_1 @ (esk13_1 @ X2)))=(esk1_0 @ X2 @ esk2_0)|(esk1_0 @ esk2_0 @ X3)=(X3)), inference(ef,[status(thm)],[c_0_18])). 100.58/100.80 thf(c_0_21, plain, (~epred2_0<=>![X2:g]:(esk1_0 @ esk7_0 @ X2)!=(esk2_0)), introduced(definition)). 100.58/100.80 thf(c_0_22, negated_conjecture, ![X2:g, X3:g]:((esk1_0 @ (esk14_1 @ X2) @ X2)=(esk2_0)|(esk1_0 @ X3 @ (esk13_1 @ X3))=(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_11])). 100.58/100.80 thf(c_0_23, negated_conjecture, ![X2:g, X3:g]:((esk1_0 @ esk2_0 @ (esk1_0 @ X2 @ esk2_0))=(esk1_0 @ X2 @ esk2_0)|(esk1_0 @ esk2_0 @ X3)=(X3)), inference(spm,[status(thm)],[c_0_19, c_0_20])). 100.58/100.80 thf(c_0_24, negated_conjecture, ![X2:g]:(epred2_0|(esk1_0 @ esk7_0 @ X2)!=(esk2_0)), inference(split_equiv,[status(thm)],[c_0_21])). 100.58/100.80 thf(c_0_25, negated_conjecture, ![X2:g, X3:g, X4:g]:((esk1_0 @ X2 @ (esk1_0 @ X3 @ (esk13_1 @ (esk1_0 @ X2 @ X3))))=(esk2_0)|(esk1_0 @ (esk14_1 @ X4) @ X4)=(esk2_0)), inference(spm,[status(thm)],[c_0_22, c_0_13])). 100.58/100.80 thf(c_0_26, negated_conjecture, ![X2:g]:(esk1_0 @ esk2_0 @ (esk1_0 @ X2 @ esk2_0))=(esk1_0 @ X2 @ esk2_0), inference(ef,[status(thm)],[c_0_23])). 100.58/100.80 thf(c_0_27, negated_conjecture, ![X2:g]:((esk1_0 @ (esk14_1 @ X2) @ X2)=(esk2_0)|epred2_0), inference(spm,[status(thm)],[c_0_24, c_0_25])). 100.58/100.80 thf(c_0_28, negated_conjecture, ![X2:g, X3:g]:((esk1_0 @ (esk14_1 @ X2) @ X2)=(esk2_0)|(esk1_0 @ X3 @ esk2_0)=(X3)), inference(split_conjunct,[status(thm)],[c_0_11])). 100.58/100.80 thf(c_0_29, negated_conjecture, ![X2:g, X3:g]:((esk1_0 @ esk2_0 @ X2)=(X2)|(esk1_0 @ esk2_0 @ X3)=(X3)), inference(spm,[status(thm)],[c_0_26, c_0_15])). 100.58/100.80 thf(c_0_30, negated_conjecture, ![X2:g, X3:g]:((esk1_0 @ (esk14_1 @ X2) @ (esk1_0 @ X2 @ X3))=(esk1_0 @ esk2_0 @ X3)|epred2_0), inference(spm,[status(thm)],[c_0_13, c_0_27])). 100.58/100.80 thf(c_0_31, negated_conjecture, ![X2:g, X3:g, X4:g]:((esk1_0 @ (esk14_1 @ X2) @ (esk1_0 @ X2 @ X3))=(esk1_0 @ esk2_0 @ X3)|(esk1_0 @ X4 @ esk2_0)=(X4)), inference(spm,[status(thm)],[c_0_13, c_0_28])). 100.58/100.80 thf(c_0_32, negated_conjecture, ![X2:g]:(esk1_0 @ esk2_0 @ X2)=(X2), inference(ef,[status(thm)],[c_0_29])). 100.58/100.80 thf(c_0_33, negated_conjecture, ![X2:g, X3:g]:((esk1_0 @ (esk14_1 @ (esk14_1 @ X2)) @ (esk1_0 @ esk2_0 @ X3))=(esk1_0 @ esk2_0 @ (esk1_0 @ X2 @ X3))|epred2_0), inference(spm,[status(thm)],[c_0_30, c_0_30])). 100.58/100.80 thf(c_0_34, negated_conjecture, ![X2:g]:((esk1_0 @ esk2_0 @ X2)=(X2)|epred2_0), inference(spm,[status(thm)],[c_0_24, c_0_14])). 100.58/100.80 thf(c_0_35, negated_conjecture, ![X2:g, X3:g, X4:g]:((esk1_0 @ (esk14_1 @ X2) @ (esk1_0 @ X2 @ X3))=(X3)|(esk1_0 @ X4 @ esk2_0)=(X4)), inference(rw,[status(thm)],[c_0_31, c_0_32])). 100.58/100.80 thf(c_0_36, negated_conjecture, ![X2:g, X3:g]:((esk1_0 @ (esk14_1 @ (esk14_1 @ X2)) @ X3)=(esk1_0 @ esk2_0 @ (esk1_0 @ X2 @ X3))|epred2_0), inference(spm,[status(thm)],[c_0_33, c_0_34])). 100.58/100.80 thf(c_0_37, negated_conjecture, ![X2:g, X3:g, X4:g]:((esk1_0 @ (esk14_1 @ (esk14_1 @ X2)) @ esk2_0)=(X2)|(esk1_0 @ X3 @ esk2_0)=(X3)|(esk1_0 @ X4 @ esk2_0)=(X4)), inference(spm,[status(thm)],[c_0_35, c_0_28])). 100.58/100.80 thf(c_0_38, negated_conjecture, ![X2:g]:((esk1_0 @ esk2_0 @ (esk1_0 @ X2 @ (esk14_1 @ X2)))=(esk2_0)|epred2_0), inference(spm,[status(thm)],[c_0_27, c_0_36])). 100.58/100.80 thf(c_0_39, negated_conjecture, ![X2:g, X3:g]:((esk1_0 @ (esk14_1 @ (esk14_1 @ X2)) @ esk2_0)=(X2)|(esk1_0 @ X3 @ esk2_0)=(X3)), inference(ef,[status(thm)],[c_0_37])). 100.58/100.80 thf(c_0_40, plain, (~epred1_0<=>![X3:g]:((esk1_0 @ X3 @ esk12_0)!=(esk2_0)|(esk1_0 @ esk6_0 @ esk2_0)!=(esk6_0)|(esk1_0 @ esk2_0 @ esk11_0)!=(esk11_0)|(esk1_0 @ (esk1_0 @ esk8_0 @ esk9_0) @ esk10_0)!=(esk1_0 @ esk8_0 @ (esk1_0 @ esk9_0 @ esk10_0))|(esk1_0 @ (esk1_0 @ esk3_0 @ esk4_0) @ esk5_0)!=(esk1_0 @ esk3_0 @ (esk1_0 @ esk4_0 @ esk5_0)))), introduced(definition)). 100.58/100.80 thf(c_0_41, negated_conjecture, ![X2:g, X3:g]:((esk1_0 @ (esk1_0 @ esk3_0 @ esk4_0) @ esk5_0)!=(esk1_0 @ esk3_0 @ (esk1_0 @ esk4_0 @ esk5_0))|(esk1_0 @ esk6_0 @ esk2_0)!=(esk6_0)|(esk1_0 @ esk7_0 @ X2)!=(esk2_0)|(esk1_0 @ (esk1_0 @ esk8_0 @ esk9_0) @ esk10_0)!=(esk1_0 @ esk8_0 @ (esk1_0 @ esk9_0 @ esk10_0))|(esk1_0 @ esk2_0 @ esk11_0)!=(esk11_0)|(esk1_0 @ X3 @ esk12_0)!=(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_11])). 100.58/100.80 thf(c_0_42, negated_conjecture, ![X2:g]:((esk1_0 @ X2 @ (esk14_1 @ X2))=(esk2_0)|epred2_0), inference(spm,[status(thm)],[c_0_34, c_0_38])). 100.58/100.80 thf(c_0_43, negated_conjecture, ![X2:g, X3:g, X4:g]:((esk1_0 @ (esk14_1 @ (esk14_1 @ X2)) @ X3)=(esk1_0 @ X2 @ X3)|(esk1_0 @ X4 @ esk2_0)=(X4)), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13, c_0_39]), c_0_32])). 100.58/100.80 thf(c_0_44, negated_conjecture, ![X2:g]:(epred1_0|(esk1_0 @ (esk1_0 @ esk8_0 @ esk9_0) @ esk10_0)!=(esk1_0 @ esk8_0 @ (esk1_0 @ esk9_0 @ esk10_0))|(esk1_0 @ (esk1_0 @ esk3_0 @ esk4_0) @ esk5_0)!=(esk1_0 @ esk3_0 @ (esk1_0 @ esk4_0 @ esk5_0))|(esk1_0 @ esk6_0 @ esk2_0)!=(esk6_0)|(esk1_0 @ esk2_0 @ esk11_0)!=(esk11_0)|(esk1_0 @ X2 @ esk12_0)!=(esk2_0)), inference(split_equiv,[status(thm)],[c_0_40])). 100.58/100.80 thf(c_0_45, negated_conjecture, (~epred2_0|~epred1_0), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_41, c_0_40]), c_0_21])). 100.58/100.80 thf(c_0_46, negated_conjecture, epred2_0, inference(spm,[status(thm)],[c_0_24, c_0_42])). 100.58/100.80 thf(c_0_47, negated_conjecture, ![X2:g, X3:g, X4:g]:((esk1_0 @ X2 @ esk2_0)=(X2)|(esk1_0 @ X3 @ esk2_0)=(X3)|(esk1_0 @ X4 @ esk2_0)=(X4)), inference(spm,[status(thm)],[c_0_39, c_0_43])). 100.58/100.80 thf(c_0_48, negated_conjecture, ![X2:g]:(epred1_0|(esk1_0 @ esk6_0 @ esk2_0)!=(esk6_0)|(esk1_0 @ esk2_0 @ esk11_0)!=(esk11_0)|(esk1_0 @ X2 @ esk12_0)!=(esk2_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_44, c_0_13]), c_0_13])])). 100.58/100.80 thf(c_0_49, negated_conjecture, ~epred1_0, inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_45, c_0_46])])). 100.58/100.80 thf(c_0_50, negated_conjecture, ![X2:g, X3:g]:((esk1_0 @ X2 @ esk2_0)=(X2)|(esk1_0 @ X3 @ esk2_0)=(X3)), inference(ef,[status(thm)],[c_0_47])). 100.58/100.80 thf(c_0_51, negated_conjecture, ![X2:g]:((esk1_0 @ esk6_0 @ esk2_0)!=(esk6_0)|(esk1_0 @ X2 @ esk12_0)!=(esk2_0)), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_48, c_0_32])]), c_0_49])). 100.58/100.80 thf(c_0_52, negated_conjecture, ![X2:g]:(esk1_0 @ X2 @ esk2_0)=(X2), inference(ef,[status(thm)],[c_0_50])). 100.58/100.80 thf(c_0_53, negated_conjecture, ![X2:g]:(esk1_0 @ X2 @ esk12_0)!=(esk2_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_51, c_0_52])])). 100.58/100.80 thf(c_0_54, negated_conjecture, ![X2:g]:(esk1_0 @ X2 @ (esk13_1 @ X2))=(esk2_0), inference(spm,[status(thm)],[c_0_53, c_0_22])). 100.58/100.80 thf(c_0_55, negated_conjecture, ![X2:g, X3:g]:(esk1_0 @ X2 @ (esk1_0 @ (esk13_1 @ X2) @ X3))=(X3), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13, c_0_54]), c_0_32])). 100.58/100.80 thf(c_0_56, negated_conjecture, ![X2:g]:(esk13_1 @ (esk13_1 @ X2))=(X2), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55, c_0_54]), c_0_52])). 100.58/100.80 thf(c_0_57, negated_conjecture, ![X2:g]:(esk1_0 @ (esk13_1 @ X2) @ X2)=(esk2_0), inference(spm,[status(thm)],[c_0_54, c_0_56])). 100.58/100.80 thf(c_0_58, negated_conjecture, ($false), inference(spm,[status(thm)],[c_0_53, c_0_57]), ['proof']). 100.58/100.80 # SZS output end CNFRefutation 100.58/100.80 # Proof object total steps : 59 100.58/100.80 # Proof object clause steps : 45 100.58/100.80 # Proof object formula steps : 14 100.58/100.80 # Proof object conjectures : 48 100.58/100.80 # Proof object clause conjectures : 45 100.58/100.80 # Proof object formula conjectures : 3 100.58/100.80 # Proof object initial clauses used : 8 100.58/100.80 # Proof object initial formulas used : 8 100.58/100.80 # Proof object generating inferences : 31 100.58/100.80 # Proof object simplifying inferences : 16 100.58/100.80 # Training examples: 0 positive, 0 negative 100.58/100.80 # Parsed axioms : 16 100.58/100.80 # Removed by relevancy pruning/SinE : 0 100.58/100.80 # Initial clauses : 18 100.58/100.80 # Removed in clause preprocessing : 8 100.58/100.80 # Initial clauses in saturation : 10 100.58/100.80 # Processed clauses : 1760 100.58/100.80 # ...of these trivial : 34 100.58/100.80 # ...subsumed : 1370 100.58/100.80 # ...remaining for further processing : 356 100.58/100.80 # Other redundant clauses eliminated : 0 100.58/100.80 # Clauses deleted for lack of memory : 0 100.58/100.80 # Backward-subsumed : 103 100.58/100.80 # Backward-rewritten : 230 100.58/100.80 # Generated clauses : 17204 100.58/100.80 # ...of the previous two non-trivial : 14328 100.58/100.80 # Contextual simplify-reflections : 7 100.58/100.80 # Paramodulations : 17003 100.58/100.80 # Factorizations : 88 100.58/100.80 # NegExts : 0 100.58/100.80 # Equation resolutions : 8 100.58/100.80 # Propositional unsat checks : 0 100.58/100.80 # Propositional check models : 0 100.58/100.80 # Propositional check unsatisfiable : 0 100.58/100.80 # Propositional clauses : 0 100.58/100.80 # Propositional clauses after purity: 0 100.58/100.80 # Propositional unsat core size : 0 100.58/100.80 # Propositional preprocessing time : 0.000 100.58/100.80 # Propositional encoding time : 0.000 100.58/100.80 # Propositional solver time : 0.000 100.58/100.80 # Success case prop preproc time : 0.000 100.58/100.80 # Success case prop encoding time : 0.000 100.58/100.80 # Success case prop solver time : 0.000 100.58/100.80 # Current number of processed clauses : 22 100.58/100.80 # Positive orientable unit clauses : 10 100.58/100.80 # Positive unorientable unit clauses: 0 100.58/100.80 # Negative unit clauses : 7 100.58/100.80 # Non-unit-clauses : 5 100.58/100.80 # Current number of unprocessed clauses: 6266 100.58/100.80 # ...number of literals in the above : 20739 100.58/100.80 # Current number of archived formulas : 0 100.58/100.80 # Current number of archived clauses : 333 100.58/100.80 # Clause-clause subsumption calls (NU) : 17649 100.58/100.80 # Rec. Clause-clause subsumption calls : 14164 100.58/100.80 # Non-unit clause-clause subsumptions : 1408 100.58/100.80 # Unit Clause-clause subsumption calls : 236 100.58/100.80 # Rewrite failures with RHS unbound : 0 100.58/100.80 # BW rewrite match attempts : 63 100.58/100.80 # BW rewrite match successes : 49 100.58/100.80 # Condensation attempts : 0 100.58/100.80 # Condensation successes : 0 100.58/100.80 # Termbank termtop insertions : 233511 100.58/100.80 100.58/100.80 # ------------------------------------------------- 100.58/100.80 # User time : 97.971 s 100.58/100.80 # System time : 2.458 s 100.58/100.80 # Total time : 100.429 s 100.58/100.80 # Maximum resident set size: 1656 pages 100.58/100.80 EOF